منابع مشابه
Transforming Binary Sequences Using Priority Queues
A priority queue transforms an input sequence ~r into an output sequence r which is a re-ordering of the sequence ~r. The set R of all such related pairs is studied in the case that tr is a binary sequence. It is proved that R is a partial order and that IRI = c,~+1, the (n + 1)th Catalan number, An efficient (O(n2)) algorithm is given for computing the number of outputs achievable from a given...
متن کاملOn priority queues with priority jumps
In this paper, we investigate a simplified head-of-the-line with priority jumps (HOL-PJ) scheduling discipline. Therefore, we consider a discrete-time single-server queueing system with two priority queues of infinite capacity and with a newly introduced HOL-PJ priority scheme. We derive expressions for the probability generating function of the system contents and the packet delay. Some perfor...
متن کاملWaiting times in queues with relative priorities
This paper determines the mean waiting times for a single server multi-class queueing model with Poisson arrivals and relative priorities. If the server becomes idle, the probability that the next job is from class-i is proportional to the product between the number of class-i jobs present and their priority parameter. © 2006 Elsevier B.V. All rights reserved.
متن کاملTime Dependent Priority Queues
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive o...
متن کاملRank-Sensitive Priority Queues
We introduce the rank-sensitive priority queue — a data structure that always knows the minimum element it contains, for which insertion and deletion take O(log(n/r)) time, with n being the number of elements in the structure, and r being the rank of the element being inserted or deleted (r = 1 for the minimum, r = n for the maximum). We show how several elegant implementations of rank-sensitiv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2001
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(00)00186-9